associative container造句

• The C + + Standard Library defines four associative container classes.
• Another Standard ML implementation, Moscow ML, also provides some associative containers.
• GHC, the most commonly used implementation of Haskell, provides two more types of associative containers.
• To preserve backwards compatibility, heterogeneous lookup is only allowed when the comparator given to the associative container allows it.
• They correspond to the four existing binary-search-tree-based associative containers, with an unordered _ prefix.
• The unordered associative containers are similar to the associative containers in the C + + Standard Library but have different constraints.
• The unordered associative containers are similar to the associative containers in the C + + Standard Library but have different constraints.
• As their name implies, the elements in the unordered associative containers are not iterated through like a regular associative container.
• As their name implies, the elements in the unordered associative containers are not iterated through like a regular associative container.
• This is because an associative container's methods can take advantage of knowledge of the internal structure, which is opaque to algorithms using iterators.
• The requirements for the most significant extension ( associative containers ) had to be shown to be consistent by fully implementing them, a task Stepanov delegated to Musser.
• For example, performing a search on an associative container such as a map or set can be much slower using iterators than by calling member functions offered by the container itself.
• In the programming language C + +, "'unordered associative containers "'are a group of class templates in the C + + Standard Library that implement hash table variants.
• In computing, "'associative containers "'refer to a group of class templates in the templates, they can be used to store arbitrary elements, such as integers or custom classes.